An Optimal Jumper Insertion Algorithm for Antenna Avoidance/Fixing on General Routing Trees with Obstacles
نویسندگان
چکیده
We study in this paper the problem of jumper insertion on general routing (Steiner/spanning) trees with obstacles for antenna avoidance/fixing at the routing and/or postlayout stages. We formulate the jumper insertion for antenna avoidance/fixing as a tree-cutting problem and present the first optimal algorithm for the general tree-cutting problem. We show that the tree-cutting problem exhibits the properties of optimal substructures and greedy choices. With these properties, we present an O((V + D) lgD)-time optimal jumper insertion algorithm that uses the least number of jumpers to avoid/fix the antenna violations on a Steiner/spanning tree with V vertices and D obstacles. Experimental results show the superior effectiveness and efficiency of our algorithm.
منابع مشابه
Fixing Antenna Problem by Dynamic Diode Dropping and Jumper Insertion
This paper describes three ways to fix antenna problems: (1) diode dropping, (2) jumper insertion, and (3) diode dropping with extension wires. Basic principles of these methods are compared and results are presented. Diode structures, SPIC simulation, and diode slicing are also discussed in this paper.
متن کاملA Polynomial Time Optimal Diode Insertion/Routing Algorithm for Fixing Antenna Problem
Abstract Antenna problem is a phenomenon of plasma induced gate oxide degradation. It directly affects manufacturability of VLSI circuits, especially in deep-submicron technology using high density plasma. Diode insertion is a very effective way to solve this problem. Ideally diodes are inserted directly under the wires that violate antenna rules. But in today’s high-density VLSI layouts, there...
متن کاملMulticast computer network routing using genetic algorithm and ant colony
Due to the growth and development of computer networks, the importance of the routing topic has been increased. The importance of the use of multicast networks is not negligible nowadays. Many of multimedia programs need to use a communication link to send a packet from a sender to several receivers. To support such programs, there is a need to make an optimal multicast tree to indicate the opt...
متن کاملmSMART: A Signal-integrity-, MAnufacturing-, Reliability-, and Timing-Driven Multilevel Full-Chip Routing
To handle these challenges, I implemented a Signalintegrity-, MAnufacturing-, Reliability-, and Timing-driven multilevel routing system (mSMART) which the related publication are presented in some major EDA conferences. The rest of this abstract is organized as follows. Section 2 presents the multilevel routing framework. Section 3 presents a fast crosstalkand performancedriven multilevel routi...
متن کاملRobot Path Planning Using Cellular Automata and Genetic Algorithm
In path planning Problems, a complete description of robot geometry, environments and obstacle are presented; the main goal is routing, moving from source to destination, without dealing with obstacles. Also, the existing route should be optimal. The definition of optimality in routing is the same as minimizing the route, in other words, the best possible route to reach the destination. In most...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006